A note on constrained degree reduction of polynomials in Bernstein–Bézier form over simplex domain

Constrained multi-degree reduction of Bézier surfaces using Jacobi polynomials

Article history: Received 9 March 2007 Received in revised form 16 June 2008 Accepted 20 October 2008 Available online 1 November 2008

A note on degree-constrained subgraphs

Elementary proofs are presented for two graph theoretic results, originally proved by H. Shirazi and J. Verstraëte using the combinatorial Nullstellensatz. In an undirected graph G = (V, E) we denote by dG(v) the degree of v ∈ V . If F (v) ⊆ N is a set of forbidden degrees for every v ∈ V , then a subgraph G = (V, E) of G is called F -avoiding if dG′(v) / ∈ F (v) for all v ∈ V . Theorem 1 (Shir...

the effect of consciousness raising (c-r) on the reduction of translational errors: a case study

در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...

A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs

A PTAS for the minimization of polynomials of fixed degree over the simplex - Extended abstract

One may assume w.l.o.g. that p(x) is a homogeneous polynomial (form). Indeed, as observed in [2], if p(x) = ∑d l=0 pl(x), where pl(x) is homogeneous of degree l, then minimizing p(x) over ∆ is equivalent to minimizing the degree d form p(x) := ∑d l=0 pl(x)( ∑n i=1 xi) . Problem (1) is an NP-hard problem, already for forms of degree d = 2, as it contains the maximum stable set problem. Indeed, f...